Location:
Search - REAL FFT
Search list
Description: 图像fft,用来做图片的二维fft变换,实时性好,变换迅速,从台湾网上当下来的-images used in making two-dimensional images fft transformation, real-time, and the rapid transformation from Taiwan from the Internet when
Platform: |
Size: 221184 |
Author: dacong56 |
Hits:
Description: 采用按时间抽选的基4原位算法和坐标旋转数字式计算机（CORDIC）算法实现了一个FFT实时谱分析系统。-time selected by using the four-situ algorithm and coordinate rotation digital computer (CORDIC) algorithm is one is a real-time FFT spectrum analysis system.
Platform: |
Size: 2048 |
Author: 张志华 |
Hits:
Description: FFT算法研究与实现(C语言),1 倒位序算法分析,2 实数蝶形运算算法的推导,3 DIT FFT 算法的基本思想分析-Research and Implementation of FFT algorithm (C language), one inversion algorithm sequence analysis, 2 real butterfly computation algorithm is derived, 3 DIT FFT algorithm the basic idea of analysis
Platform: |
Size: 3072 |
Author: sxd |
Hits:
Description: 实现FFT和IFFT的C＋＋源码，比较经典的基二算法。-The realization of FFT and IFFT in C source code, compare the classic 2-based algorithm.
Platform: |
Size: 4096 |
Author: yequnsong |
Hits:
Description: fft的快速傅里叶变换
// data 长度为 (2 * 2^n), data 的偶位为实数部分, data 的奇位为虚数部分
// isInverse表示是否为逆变换-fft Fast Fourier Transform// data length (2* 2 ^ n), data of the dual spaces for the real part, data for the odd bit imaginary part of// isInverse said whether the inverse transform
Platform: |
Size: 6144 |
Author: 张志丹 |
Hits:
Description: 实数fft代码，源于侯朝焕老师的实用FFT信号处理技术，已验证-Real fft code, from a practical teacher Chao-huan FFT signal processing technology, has been verified
Platform: |
Size: 1024 |
Author: lixuan |
Hits:
Description: fft.c--This computes an in-place complex-to-complex FFT
x and y are the real and imaginary arrays of 2^m points.
dir = 1 gives forward transform
dir = -1 gives reverse transform -fft.c This computes an in-place complex-to-complex FFT x and y are the real and imaginary arrays of 2 ^ m points. dir = 1 gives forward transform dir =-1 gives reverse transform
Platform: |
Size: 1024 |
Author: jessie |
Hits:
Description: This computes an in-place complex-to-complex FFT
x and y are the real and imaginary arrays of 2^m points.
dir = 1 gives forward transform
dir = -1 gives reverse transform -This computes an in-place complex-to-complex FFT x and y are the real and imaginary arrays of 2 ^ m points. Dir = 1 gives forward transform dir =-1 gives reverse transform
Platform: |
Size: 1024 |
Author: jessie |
Hits:
Description: 这是一个对实数序列进行FFT变换求频谱的C语言程序，是提取语音MFCC参数的必经步骤，比一般的基于2或4的FFT能节约一半的存储空间和一半的运算量，经DSP的CCS调试成功,是本人改进的、用于本人导师故障诊断项目的一个源程序代码。-This is a real number sequences transform FFT spectrum for C language program is extracted voice MFCC parameters necessary steps than a typical 2 or 4 based on the FFT can save half the storage space and half of the computation by the DSP
Platform: |
Size: 2048 |
Author: 何正明 |
Hits:
Description: 16点FFT VHDL源程序，The xFFT16 fast Fourier transform (FFT) Core computes a 16-point complex FFT. The input data
is a vector of 16 complex values represented as 16-bit 2’s complement numbers – 16-bits for
each of the real and imaginary component of a datum.-16:00 FFT VHDL source code, The xFFT16 fast Fourier transform (FFT) Core computes a 16-point complex FFT. The input datais a vector of 16 complex values represented as 16-bit 2 s complement numbers- 16-bits foreach of the real and imaginary component of a datum.
Platform: |
Size: 1824768 |
Author: qiyuan |
Hits:
Description: Tiger sharec系列DSP的短点FFT代码(4,6,8,16点FFT),全汇编实现,将DSP的性能发挥到极致,在超高实时要求应用下有意义.-Tiger sharec Series DSP short point FFT code (4,6,8,16-point FFT), the entire compilation of the realization of the performance of the DSP to the limit, in the ultra-high real-time requirements of applications under the meaningful.
Platform: |
Size: 5120 |
Author: 赵赵 |
Hits:
Description: The fft.c file is C code for a function to compute the 16 point real Fast Fourier Transform using the split radix algorithm. -The fft.c file is C code for a function to compute the 16 point real Fast Fourier Transform using the split radix algorithm.
Platform: |
Size: 2048 |
Author: 郭曉詠 |
Hits:
Description: Radix-2 Fast Fourier Transform, real or complex sin/cos transform
-Radix-2 Fast Fourier Transform, real or complex sin/cos transform
Platform: |
Size: 40960 |
Author: dai |
Hits:
Description: ti 的FFT 算法库,里面有PDF的理论基础,和算法库,很齐全,很有参考价值.-This FFT library contains generic FFT module (32-bit implementation) for real/complex FFT
Platform: |
Size: 780288 |
Author: vincent |
Hits:
Description: 本程序是基于C54x DSP的通用实数FFT程序，适合点数16~1024点或复数点数8~512点，主程序为rfft.asm。-This procedure is based on the C54x DSP real FFT common procedures, for points 16 ~ 1024 points, or plural points 8 ~ 512 points, the main program for rfft.asm
Platform: |
Size: 31744 |
Author: dazhou |
Hits:
Description: The latest official release of FFTW is version 3.2.1, available from our download page see the release notes for what s new. (Subscribe to the fftw-announce mailing list to get release announcements.)
This release has better threading support, faster real-data transforms, faster transforms for non-power-of-two sizes with factors of 5 and 10, and support for Cell processors (see the FFTW for Cell page)-The latest official release of FFTW is version 3.2.1, available from our download page see the release notes for what s new. (Subscribe to the fftw-announce mailing list to get release announcements.)
This release has better threading support, faster real-data transforms, faster transforms for non-power-of-two sizes with factors of 5 and 10, and support for Cell processors (see the FFTW for Cell page)
Platform: |
Size: 2048 |
Author: oioioi |
Hits:
Description: 基2fft,实现对实数序列的离散快速傅里叶变换-Based 2fft, the realization of the real sequence of discrete Fast Fourier Transform
Platform: |
Size: 1024 |
Author: zhaoyan |
Hits:
Description: 多维傅里叶变换，二维DFT快速算法，共分五部--五：三维实序列3D-DFT快速算法-Multi-dimensional Fourier transform, fast algorithm for two-dimensional DFT is divided into 5- 5: Three-dimensional real sequence of 3D-DFT Fast Algorithm
Platform: |
Size: 4096 |
Author: jet ju |
Hits:
Description: Program FFT.FOR
This FORTRAN program calculates the fast Fourier transform of a
timeseries (real and/or complex) or the inverse Fourier transform
of spectral components (real and/or complex). The FFT is based
on the algorithm given in Numerical Recipes, Cambridge University
Press, 1994.-Program FFT.FOR
This FORTRAN program calculates the fast Fourier transform of a
timeseries (real and/or complex) or the inverse Fourier transform
of spectral components (real and/or complex). The FFT is based
on the algorithm given in Numerical Recipes, Cambridge University
Press, 1994.
Platform: |
Size: 71680 |
Author: 梦回 |
Hits:
Description: FFT 并不是一种新的变换，它是离散傅立叶变换（DFT）的一种快速算法。由于我们在计算DFT 时一次复数乘法需用四次实数乘法和二次实数加法；一次复数加法则需二次实数加
法。每运算一个X（k）需要4N 次复数乘法及2N+2（N-1）=2（2N-1）次实数加法。所以
整个DFT 运算总共需要4N^2 次实数乘法和N*2(2N-1)=2N(2N-1)次实数加法。如此一来，计算时乘法次数和加法次数都是和N^2 成正比的，当N 很大时，运算量是可观的，因而需要
改进对DFT 的算法减少运算速度。-FFT is not a new transformation, it is the discrete Fourier transform (DFT) of a fast algorithm. Since we have a complex multiplication when calculating DFT Xuyong four real multiplications and real additions secondary a complex quadratic addition Zexu real addition. Each operator of a X (k) requires 4N times complex multiplication and 2N+2 (N-1) = 2 (2N-1) times the real number addition. Therefore, the DFT computation requires 4N ^ 2 times in total real multiplications and N* 2 (2N-1) = 2N (2N-1) times the real number addition. Thus, when calculating the number of multiplications and additions and are proportional to N ^ 2, when N is large, the computation is considerable and, therefore, need to improve on the DFT algorithm to reduce computational speed.
Platform: |
Size: 404480 |
Author: 平意义 |
Hits:
« 12
3
4
5
6
7
8
9
10
...
13
»